适用于共架武器的通用筒弹模拟系统应用研究

针对通用发控单元的维护需求和共架武器系统的训练需求,设计了通用筒弹模拟系统.该系统通过1553B总线与通用发控单元通信,实现了筒弹功能模拟和筒弹故障模拟.经测试,该系统运行稳定可靠,各项功能满足设计指标.     

液压水锤效应引起液体喷溅特性及其影响因素试验研究

为研究液压水锤效应引起的液体喷溅特性及其影响因素,进行了高速破片撞击充液容器的试验,测试了液体内的空腔振荡特性、压力分布特性和容器外的液体喷溅特性。试验结果表明:液压水锤效应引起的液体喷溅有两个不同的阶段。第一个阶段发生在空腔生长到最大体积后的400~700 μs内,喷溅液体的头部呈箭状;在第二个阶段出现多次形状相似的脉动喷溅,且单次脉动均发生在每次空腔溃灭之后,喷溅液体具有伞状头部与线状尾部。液体内的压力和侵彻孔的形态共同影响液体的喷溅速度,相对喷溅速度与破片的撞击速度成反比。喷溅液体在运动过程中存在速度波动,且随着喷溅次数的增加,液体喷溅速度逐渐下降,速度拐点出现的位置逐渐接近侵彻孔。     

Newsvendor bounds and heuristics for serial supply chains with regular and expedited shipping

We study an infinite‐horizon, N‐stage, serial production/inventory system with two transportation modes between stages: regular shipping and expedited shipping. The optimal inventory policy for this system is a top–down echelon base‐stock policy, which can be computed through minimizing 2N nested convex functions recursively (Lawson and Porteus, Oper Res 48 (2000), 878–893). In this article, we first present some structural properties and comparative statics for the parameters of the optimal inventory policies, we then derive simple, newsvendor‐type lower and upper bounds for the optimal control parameters. These results are used to develop near optimal heuristic solutions for the echelon base‐stock policies. Numerical studies show that the heuristic performs well. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Using container inspection history to improve interdiction logistics for illicit nuclear materials

Strengthening the United States' ability to prevent adversaries from smuggling nuclear materials into the country is a vital and ongoing issue. The prospect of additional countries, such as Iran, obtaining the know‐how and equipment to produce these special nuclear materials in the near future underscores the need for efficient and effective inspection policies at ports and border crossings. In addition, the reduction of defense and homeland security budgets in recent years has made it increasingly important to accomplish the interdiction mission with fewer funds. Addressing these complications, in this article, we present a novel two‐port interdiction model. We propose using prior inspection data as a low‐cost way of increasing overall interdiction performance. We provide insights into two primary questions: first, how should a decision maker at a domestic port use detection data from the foreign port to improve the overall detection capability? Second, what are potential limitations to the usefulness of prior inspection data—is it possible that using prior data actually harms decision making at the domestic port? We find that a boundary curve policy (BCP) that takes into account both foreign and domestic inspection data can provide a significant improvement in detection probability. This BCP also proves to be surprisingly robust, even if adversaries are able to infiltrate shipments during transit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 433‐448, 2013     

Convoys to combat Somali piracy

As the world becomes increasingly globalized, interruptions to international trade cannot be permitted. Piracy off the coast of Somalia has hampered international trade in the region and poses significant risks to the sailors required to navigate those waters. Over the past three years the global community has attempted, through a number of different naval tactics, to stop these acts of piracy; however, these tactics have proven ineffective. This article looks at historical precedence and military theory to support the concept of using convoys to protect the thousands of cargo vessels traveling round the Horn of Africa every year. This tactic will greatly decrease the number of successful pirate attacks and save countless lives in the process.     

基于模糊证据理论的船舶安全评估

针对船舶安全评估过程中的诸多不确定因素,提出了一种基于模糊证据理论的安全评估方法.将证据体空间中的事件视为模糊子集,并引入模糊概率,更好地描述了专家意见(或知识),给出了质量分配函数的表示.最后,结合某船舶系统,给出了其安全评估的具体实现过程.结果表明,该方法可靠、有效.     

Terminal allocation problem in a transshipment hub considering bunker consumption

This article investigates the method of allocating arriving vessels to the terminals in transshipment hubs. The terminal allocation decision faced by a shipping alliance has the influence on the scheduled arrival time of vessels and further affects the bunker consumption cost for the vessels. A model is formulated to minimize the bunker consumption cost as well as the transportation cost of inter‐terminal transshipment flows/movements. The capacity limitation of the port resources such as quay cranes (QCs) and berths is taken into account. Besides the terminal allocation, the QC assignment decision is also incorporated in the proposed model. A local branching based method and a particle swarm optimization based method are developed to solve the model in large‐scale problem instances. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 14% of the cost when compared with the “First Come First Served” decision rule. Moreover, the proposed solution methods not only solve the proposed model within a reasonable computation time, but also obtain near‐optimal results with about 0.1～0.7% relative gap. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 529–548, 2016     

Schedule design for liner services under vessel speed reduction incentive programs

Gas and particulate emissions from ship transportation have been increasing in recent years. In order to mitigate ship emissions near coastal areas, voluntary vessel speed reduction incentive programs (VSRIPs) were put in place by a number of ports. This paper studies a schedule design problem faced by liner shipping companies under VSRIPs. It proposes a mixed-integer nonlinear mathematical model for the minimization of the total cost, consisting of fuel cost, as well as operating cost, minus dockage refunds. The model balances three determinants, that is, the compliance of VSRIPs, the speed limit (the maximum physical speed of ships and the upper speed limit imposed by VSRIPs), and the limited number of ships. An enumerative algorithm and a piecewise-linear approximation algorithm are developed, based on some properties of the nonlinear model. The efficiency of the proposed algorithms is validated through extensive computational experiments.     

Efficient sequential decision‐making algorithms for container inspection operations

Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006